package minCostClimbingStairs;

public class Solution {
    public int minCostClimbingStairs(int[] cost) {
        // dp[i]表示到达从i个楼梯上去的小花费
        // dp[i] = min(dp[i-1],dp[i-2])+cost[i]
        int[] dp = new int[cost.length];
        dp[0] = cost[0];
        dp[1] = cost[1];
        for (int i = 2; i < cost.length; i++) {
            dp[i] = Math.min(dp[i-1],dp[i-2])+cost[i];
        }
        return Math.min(dp[dp.length-1],dp[dp.length-2]);
    }
}
